A DEMAND-DRIVEN APPROACH FOR EFFICIENT INTERPROCEDURAL DATA FLOW ANALYSIS by
نویسندگان
چکیده
iii Acknowledgements v Table of
منابع مشابه
Demand-Driven Analysis of Explicitly Parallel Programs: An Approach Based on Reverse Data-Flow Analysis
Demand-driven data-flow analysis (DD-DFA) has been pioneered in the field of interprocedural analysis of sequential programs to accommodate the specific needs of analysis tools like debuggers and slicers, but also to compensate for the continuous growth of programs and program complexity making static program analyses more and more intricate and time consuming. Particularly successful in practi...
متن کاملA demand-driven solver for constraint-based control flow analysis
This thesis develops a demand driven solver for constraint based control flow analysis. Our approach is modular, flow-sensitive and scaling. It allows to efficiently construct the interprocedural control flow graph (ICFG) for object-oriented languages. The analysis is based on the formal semantics of a Java-like language. It is proven to be correct with respect to this semantics. The base algor...
متن کاملSensitivity Analysis of Technology Changes for EnergyDemand by Iranian Economic Sectors: an Application of Sherman-Morrisson Method and Input-Output Approach
We undertook a sensitivity analysis of the key demand factors leading to changes of energy consumption in the competitive market, using a Leontief demand-driven approach. We applied the Leontief model to previous research results to study the most sensitive factors leading to the change of energy demand in different economic sectors. Based on the 2011 Iranian symmetrical input–output table, the...
متن کاملEfficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysis. Our algorithm works particularly well for interprocedural analyses. By contrast, traditional algorithms work well for individual procedures but do not scale well to interprocedural analysis because they spend too m...
متن کاملGenerating program analyzers
In this work the automatic generation of program analyzers from concise specifications is presented. It focuses on provably correct and complex interprocedural analyses for real world sized imperative programs. Thus, a powerful and flexible specification mechanism is required, enabling both correctness proofs and efficient implementations. The generation process relies on the theory of data flo...
متن کامل